53 research outputs found
Forming Probably Stable Communities with Limited Interactions
A community needs to be partitioned into disjoint groups; each community
member has an underlying preference over the groups that they would want to be
a member of. We are interested in finding a stable community structure: one
where no subset of members wants to deviate from the current structure. We
model this setting as a hedonic game, where players are connected by an
underlying interaction network, and can only consider joining groups that are
connected subgraphs of the underlying graph. We analyze the relation between
network structure, and one's capability to infer statistically stable (also
known as PAC stable) player partitions from data. We show that when the
interaction network is a forest, one can efficiently infer PAC stable coalition
structures. Furthermore, when the underlying interaction graph is not a forest,
efficient PAC stabilizability is no longer achievable. Thus, our results
completely characterize when one can leverage the underlying graph structure in
order to compute PAC stable outcomes for hedonic games. Finally, given an
unknown underlying interaction network, we show that it is NP-hard to decide
whether there exists a forest consistent with data samples from the network.Comment: 11 pages, full version of accepted AAAI-19 pape
Axiomatic Characterization of Data-Driven Influence Measures for Classification
We study the following problem: given a labeled dataset and a specific
datapoint x, how did the i-th feature influence the classification for x? We
identify a family of numerical influence measures - functions that, given a
datapoint x, assign a numeric value phi_i(x) to every feature i, corresponding
to how altering i's value would influence the outcome for x. This family, which
we term monotone influence measures (MIM), is uniquely derived from a set of
desirable properties, or axioms. The MIM family constitutes a provably sound
methodology for measuring feature influence in classification domains; the
values generated by MIM are based on the dataset alone, and do not make any
queries to the classifier. While this requirement naturally limits the scope of
our framework, we demonstrate its effectiveness on data
Learning Cooperative Games
This paper explores a PAC (probably approximately correct) learning model in
cooperative games. Specifically, we are given random samples of coalitions
and their values, taken from some unknown cooperative game; can we predict the
values of unseen coalitions? We study the PAC learnability of several
well-known classes of cooperative games, such as network flow games, threshold
task games, and induced subgraph games. We also establish a novel connection
between PAC learnability and core stability: for games that are efficiently
learnable, it is possible to find payoff divisions that are likely to be stable
using a polynomial number of samples.Comment: accepted to IJCAI 201
Influence in Classification via Cooperative Game Theory
A dataset has been classified by some unknown classifier into two types of
points. What were the most important factors in determining the classification
outcome? In this work, we employ an axiomatic approach in order to uniquely
characterize an influence measure: a function that, given a set of classified
points, outputs a value for each feature corresponding to its influence in
determining the classification outcome. We show that our influence measure
takes on an intuitive form when the unknown classifier is linear. Finally, we
employ our influence measure in order to analyze the effects of user profiling
on Google's online display advertising.Comment: accepted to IJCAI 201
- …